An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract)
نویسنده
چکیده
منابع مشابه
Oblivious Transfer via McEliece's PKC and Permuted Kernels
We present two efficient protocols for two flavors of oblivious transfer (OT): the Rabin and 1-out-of-2 OT using the McEliece cryptosystem and Shamir’s zero-knowledge identification scheme based on permuted kernels. This is a step towards diversifying computational assumptions on which OT – the primitive of central importance – can be based. Although we obtain a weak version of Rabin OT (where ...
متن کاملA New NP-Complete Problem and Public-Key Identification
The appearance of the theory of zero-knowledge, presented by Goldwasser, Micali and Rackoff in 1985, opened a way to secure identification schemes. The first application was the famous Fiat-Shamir scheme based on the problem of modular square roots extraction. In the following years, many other schemes have been proposed, some Fiat-Shamir extensions but also new discrete logarithm based schemes...
متن کاملPublic-Key Identification Schemes Based on Multivariate Quadratic Polynomials
A problem of solving a system of multivariate quadratic polynomials over a finite field, which is called an MQ problem, is a promising problem in cryptography. A number of studies have been conducted on designing public-key schemes using the MQ problem, which are known as multivariate public-key cryptography (MPKC). However, the security of the existing schemes in MPKC relies not only on the MQ...
متن کاملA New Identification Scheme Based on the Perceptrons Problem
Identification is a useful cryptographic tool. Since zero-knowledge theory appeared [3], several interactive identification schemes have been proposed (in particular Fiat-Shamir [2] and its variants [4, 6, 5], Schnorr [9]). These identifications are based on number theoretical problems. More recently, new schemes appeared with the peculiarity that they are more efficient from the computational ...
متن کاملAnalysis of Some Natural Variants of the PKP Algorithm
In 1989, (Shamir, 1989) proposed a new zero-knowledge identification scheme based on a NP-complete problem called PKP for Permuted Kernel Problem. For a given prime p, a given matrix A and a given vector V , the problem is to find a permutation π such that the permuted vector Vπ verifies A ·Vπ = 0 mod p. This scheme is still in 2011 known as one of the most efficient identification scheme based...
متن کامل